Effective bounds for P-recursive sequences

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Effective Bounds for P-Recursive Sequences

We describe an algorithm that takes as input a complex sequence (un) given by a linear recurrence relation with polynomial coe cients along with initial values, and outputs a simple explicit upper bound (vn) such that |un| ≤ vn for all n. Generically, the bound is tight, in the sense that its asymptotic behaviour matches that of un. We discuss applications to the evaluation of power series with...

متن کامل

Exponential Tail Bounds for Max-recursive Sequences

Exponential tail bounds are derived for solutions of max-recursive equations and for maxrecursive random sequences, which typically arise as functionals of recursive structures, of random trees or in recursive algorithms. In particular they arise in the worst case analysis of divide and conquer algorithms, in parallel search algorithms or in the height of random tree models. For the proof we de...

متن کامل

Exponential Bounds and Tails for Additive Random Recursive Sequences

Exponential bounds and tail estimates are derived for additive random recursive sequences, which typically arise as functionals of recursive structures, of random trees or in recursive algorithms. In particular they arise as parameters of divide and conquer type algorithms. We derive tail bounds from estimates of the Laplace transforms and of the moment sequences. For the proof we use some clas...

متن کامل

P - Recursive Integer Sequences and Automata Theory

of the Dissertation P-Recursive Integer Sequences and Automata Theory by Scott Michael Garrabrant Doctor of Philosophy in Mathematics University of California, Los Angeles, 2015 Professor Igor Pak, Chair An integer sequence {an} is called polynomially recursive, or P-recursive, if it satisfies a nontrivial linear recurrence relation of the form q0(n)an + q1(n)an−1 + . . . + qk(n)an−k = 0 , for ...

متن کامل

p-ADIC ASYMPTOTIC PROPERTIES OF CONSTANT-RECURSIVE SEQUENCES

In this article we study p-adic properties of sequences of integers (or p-adic integers) that satisfy a linear recurrence with constant coefficients. For such a sequence, we give an explicit approximate twisted interpolation to Zp. We then use this interpolation for two applications. The first is that certain subsequences of constant-recursive sequences converge p-adically. The second is that t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 2010

ISSN: 0747-7171

DOI: 10.1016/j.jsc.2010.06.024